Primitive C-command 2. Puzzles of Primitives
نویسندگان
چکیده
Work in syntactic theory has almost universally assumed that phrase structure is characterized in terms of the abstract structural relations of dominance and precedence. In this paper, we suggest instead that hierarchical structure is determined by a primitive relation of c-command. This proposal has the consequence that the range of possible phrase structures is substantially restricted in a linguistically natural way, obviating the need for certain previously stipulated restrictions. Furthermore, by understanding structure in terms of primitive c-command, we arrive at a natural understanding of the structural and derivational diierences between substitution and adjunction, without resort to the machinery of segments and categories. Any descriptively adequate grammatical theory must precisely specify the well-formed representations for the sentences of all possible human languages. Part of this task involves determining what kind of formal object constitutes the basis for grammatical representations. From the outset of generative grammar, it has been assumed almost without exception that phrase structure should be represented in terms of certain type of abstract graph, a tree, whose leaves correspond to lexical items and whose internal connectivity, what is often called constituency , reeects a range of distributional facts. Yet, the question of how tree structures are best characterized has been relatively neglected in the literature on syntactic theory. There seems to be widespread, if only implicit, adoption of the view sketched in Partee et al. (1993), inter alia, in which trees are determined by two primitive relations: dominance and precedence. Yet, so far as we are aware, there have been no empirical arguments adduced in favor of this choice. Recent work in syntactic theory, particularly under the impetus of the minimalist Thanks to the following for stimulating discussion: 2 robert frank and k. vijay-shanker program, has reopened a number of fundamental questions. It therefore seems an appropriate point to reconsider the choice of dominance and precedence as the primitives for syntactic description. In this paper, we argue that the choice of dominance and precedence in fact introduces a number of puzzling dilemmas for syntactic theory, all centering around the over-expressiveness of these relations. These dilemmas motivate our proposal that hierarchical structure be obtained in terms of a diierent primitive structural relation, namely c-command. In section 3, we investigate the formal issues involved in characterizing phrase structure in terms of c-command directly, and in section 4 we compare the expressiveness of this system to one utilizing primitive dominance and …
منابع مشابه
Security Amplification for InteractiveCryptographic Primitives
Security amplification is an important problem in Cryptography: starting with a “weakly secure” variant of some cryptographic primitive, the goal is to build a “strongly secure” variant of the same primitive. This question has been successfully studied for a variety of important cryptographic primitives, such as one-way functions, collision-resistant hash functions, encryption schemes and weakl...
متن کاملC∅C∅: A Framework for Building Composable Zero-Knowledge Proofs
Non-interactive zero-knowledge proofs are a powerful cryptographic primitive used in privacypreserving protocols. We design and build C∅C∅, the first system enabling developers to build efficient, composable, non-interactive zero-knowledge proofs for generic, user-defined statements. C∅C∅ extends state-of-the-art SNARK constructions by applying known strengthening transformations to yield UC-co...
متن کاملThe Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block ciphers, or using an arbitrary mix of different decryption algorithms – such as any three keys out of two AES keys, a 3DES key, an RSA key and a one-time pad. We also provide a new way to combine different types of pri...
متن کاملOptimal Movement Primitives
The theory of Optimal Unsupervised Motor Learning shows how a network can discover a reduced-order controller for an unknown nonlinear system by representing only the most significant modes. Here, I extend the theory to apply to command sequences, so that the most significant components discovered by the network correspond to motion "primitives". Combinations of these primitives can be used to ...
متن کاملNew Enhanced Security For Data Transmission Across Mobile Adhoc Network
The Communication systems are typical data systems, which can be undetermined by unauthorized users who have illegal access to the systems. Main Problem created in attacking to malicious node and group of network, whole traffic by system break, data loss, data affecting and data failure system. Overcome node Proposed scheme uses a role-based access control frame work, MANET concept working algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998